Dynamical systems method for solving linear finite-rank operator equations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamical systems method for solving linear finite-rank operator equations

A version of the dynamical systems method (DSM) for solving ill-conditioned linear algebraic systems is studied. An a priori and an a posteriori stopping rules are justified. An iterative scheme is constructed for solving ill-conditioned linear algebraic systems.

متن کامل

Dynamical Systems Method for Solving Operator Equations

Consider an operator equation F(u)=0 in a Hilbert space H and assume that this equation is solvable. Let us call the problem of solving this equation ill-posed if the operator F ′(u) is not boundedly invertible, and well-posed otherwise. A general method, Dynamical Systems Method (DSM), for solving linear and nonlinear illposed problems in H is presented. This method consists of the constructio...

متن کامل

Dynamical Systems Method for solving nonlinear operator equations

Consider an operator equation (*) B(u) + u = 0 in a real Hilbert space, where > 0 is a small constant. The DSM (Dynamical Systems Method) for solving equation (*) consists of finding and solving a Cauchy problem: u̇ = Φ(t, u), u(0) = u0, t ≥ 0, which has the following properties: 1) it has a global solution u(t), 2) this solution tends to a limit as time tends to infinity, i.e., u(∞) exists, 3) ...

متن کامل

Entropy operator for continuous dynamical systems of finite topological entropy

In this paper we introduce the concept of entropy operator for continuous systems of finite topological entropy. It is shown that it generates the Kolmogorov entropy as a special case. If $phi$ is invertible then the entropy operator is bounded with the topological entropy of $phi$ as its norm.

متن کامل

‎A matrix LSQR algorithm for solving constrained linear operator equations

In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Polonici Mathematici

سال: 2009

ISSN: 0066-2216,1730-6272

DOI: 10.4064/ap95-1-6